Flexible route lookup using range search
نویسندگان
چکیده
The rising number of entries in an Internet routing table is placing higher demands route lookup engines. This paper presents a hardware implementation of a route lookup engine based on a combination of range search and linear search. The route lookup engine is constructed using a pipeline of identical search units. The lookup engine can be configured with more than one routing table allowing for simultaneous searches in more than one table. The worst case memory usage is independent of the distribution of prefixes in the routing table. Updates to the routing tables are merged together to minimize the number of updating cycles.
منابع مشابه
Bidirectional Pipelining for Scalable IP Lookup and Packet Classification
Both IP lookup and packet classification in IP routers can be implemented by some form of tree traversal. SRAM-based Pipelining can improve the throughput dramatically. However, previous pipelining schemes result in unbalanced memory allocation over the pipeline stages. This has been identified as a major challenge for scalable pipelined solutions. This paper proposes a flexible bidirectional l...
متن کاملIP Route Lookups as String Matching
An IP route lookup can be considered as a string matching problem on the destination address. Finite State Automata (FSA) are a flexible and efficient way to match strings. This paper describes how a routing table can be encoded as an FSA and how, through a process of state reduction, we can obtain an optimal representation. This gives insights into the basic properties of the longest-prefix ma...
متن کاملGigabit-routing with Flexible Hardware Support Gigabit-routing with Flexible Hardware Support
Routers are key building blocks in networks. They need to cope with high data rates in the range of multiple gigabit per second that are owing through them. Therefore, speciically performance critical functions should be implemented in dedicated hardware units in order to speed up the forwarding task. These units can be embedded within regular workstations or into dedicated router architectures...
متن کاملBinary search schemes for fast IP lookups
IP route look up is the most time consuming operation of a router. Route lookup is becoming a very challenging problem due to the increasing size of routing tables. To reduce the number of entries, routing tables store variable length address prefixes. To determine the outgoing port for a given address, the longest matching prefix amongst all the prefixes, needs to be determined. This makes the...
متن کاملImplementation of a Parallel-search Trie-based Scheme for Fast Ip Lookup
The Internet Protocol (IP) address lookup is required to be resolved fast to keep up with data rate increases. To cope with the increasing number of entries, solutions for IP lookup based on random access memory (RAM), which store prefixes in a trie-based structure, are of interest. In this paper, we propose a flexible and fast trie-based IPlookup algorithm where parallel searching is performed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005